Affine extensions of the petersen graph and 2-arc-transitive graphs of girth 5
نویسنده
چکیده
are considered in this paper. Examples of finite Qn-geometries are constructed for any n i> 2. In particular, we obtain new examples of finite 2-arc-transitive graphs of girth 5, containing Petersen subgraphs (cf. [4], [5] for an enquiry into this class of graphs). Furthermore, we give a complete classification of Q2-geometries using coset enumeration. In particular, we show that they are all finite. Eight flag-transitive geometries with the diagram
منابع مشابه
Weakly s-arc transitive graphs
Weakly s-arc transitive graphs are introduced and determined. A graph is said to be weakly s-arc transitive if its endomorphism monoid acts transitively on the set of s-arcs. The main results are: (1) A nonbipartite graph is weakly s-arc transitive if and only if it is s-arc transitive. (2) A tree with diameter d is weakly s-arc transitive for all 0 s d. (3) A bipartite graph with girth g = 2s ...
متن کاملUnitary Graphs
Unitary graphs are arc-transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of arc-transitive graphs that admit an automorphism group acting imprimitively on the vertices. In this article, we prove that all unitary graphs are connected of diameter...
متن کاملA construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
A near-polygonal graph is a graph Γ which has a set C of m-cycles for some positive integer m such that each 2-path of Γ is contained in exactly one cycle in C. If m is the girth of Γ , then the graph is called polygonal. We provide a construction of an infinite family of polygonal graphs of arbitrary even girth with 2-arc transitive automorphism groups, showing that there are infinitely many 2...
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملWeakly Flag-transitive Configurations and Half-arc-transitive Graphs
A connguration is weakly ag-transitive if its group of automor-phisms acts intransitively on ags but the group of all automorphisms and anti-automorphisms acts transitively on ags. It is shown that weakly ag-transitive conngurations are in one-to-one correspondence with bipartite 1 2-arc-transitive graphs of girth not less than 6. Several innnite families of weakly ag-transitive conngurations a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 1992